A Factorization Attack Algorithm on RSA Cryptosystem Using Fast Searching Algorithm
نویسندگان
چکیده
منابع مشابه
Attack on RSA Cryptosystem
The RSA cryptosystem is most widely used cryptosystem it may be used to provide both secrecy and digital signatures and its security is based on the intractability of the integer factorization. The security of RSA algorithm depends on the ability of the hacker to factorize numbers. New, faster and better methods for factoring numbers are constantly being devised. The Trent best for long numbers...
متن کاملFast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applications and cryptographic accelerators. Fast modular exponentiation algorithms are often considered of practical significance in public-key cryptosystems. The RSA cryptosystem is one of the most widely used technologies f...
متن کاملThe RSA Cryptosystem: History, Algorithm, Primes
Ever since people began to write down events in their lives, there has been a need for cryptography. Cryptography is the encryption of text in such a manner that outsiders to the code cannot understand the code, but the desired reader is able to decrypt the encryption so as to understand the message. For early man, just as for modern man, there has always been a need for secrecy, because it is ...
متن کاملWagner's Attack on a Secure CRT-RSA Algorithm Reconsidered
At CCS 2003, a new CRT-RSA algorithm was presented in [BOS03], which was claimed to be secure against fault attacks for various fault models. At CCS 2004, David Wagner presented an attack on the proposed scheme, claiming that the so-called BOS scheme was insecure for all presented fault models [Wag04]. However, the attack itself contains a flaw which shows that although the BOS scheme is broken...
متن کاملA New Attack on Three Variants of the RSA Cryptosystem
In 1995, Kuwakado, Koyama and Tsuruoka presented a new RSA-type scheme based on singular cubic curves y2 ≡ x3+bx2 (mod N) where N = pq is an RSA modulus. Then, in 2002, Elkamchouchi, Elshenawy and Shaban introduced an extension of the RSA scheme to the field of Gaussian integers using a modulus N = PQ where P and Q are Gaussian primes such that p = |P| and q = |Q| are ordinary primes. Later, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of applied mathematics and computation
سال: 2022
ISSN: ['2576-0645', '2576-0653']
DOI: https://doi.org/10.26855/jamc.2022.12.001